DERGMs: Degeneracy-restricted exponential random graph models

نویسندگان

  • Vishesh Karwa
  • Sonja Petrovic
  • Denis Bajic
چکیده

We propose a new exponential family of models for random graphs. Starting from the standard exponential random graph model (ERGM) framework, we propose an extension that addresses some of the well-known issues with ERGMs. Specifically, we solve the problem of computational intractability and ‘degenerate’ model behavior by an interpretable support restriction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Geometry and Extremal Properties of the Edge-Degeneracy Model

The edge-degeneracy model is an exponential random graph model that uses the graph degeneracy, a measure of the graph’s connection density, and number of edges in a graph as its sufficient statistics. We show this model is relatively well-behaved by studying the statistical degeneracy of this model through the geometry of the associated polytope.

متن کامل

On the geometry of discrete exponential families with application to exponential random graph models

There has been an explosion of interest in statistical models for analyzing network data, and considerable interest in the class of exponential random graph (ERG) models, especially in connection with difficulties in computing maximum likelihood estimates. The issues associated with these difficulties relate to the broader structure of discrete exponential families. This paper re-examines the i...

متن کامل

Generating Similar Graphs From Spherical Features

We present new insights on model degeneracy and a novel model for generating graphs similar to a given example graph. Unlike standard approaches that compute graph features in Euclidean space, our method obtains features on a surface of a hypersphere. We utilize a von Mises-Fisher distribution, an exponential family distribution on the surface of a hypersphere, to define a model over possible f...

متن کامل

Assessing Degeneracy in Statistical Models of Social Networks

This paper presents recent advances in the statistical modeling of random graphs that have an impact on the empirical study of social networks. Statistical exponential family models (Wasserman and Pattison 1996) are a generalization of the Markov random graph models introduced by Frank and Strauss (1986), which in turn are derived from developments in spatial statistics (Besag 1974). These mode...

متن کامل

Clusterwise p* models for social network analysis

Clusterwise p∗ models are developed to detect differentially functioning network models as a function of the subset of observations being considered. These models allow the identification of subgroups (i.e., clusters) of individuals who are ‘structurally’ different from each other. These clusters are different from those produced by standard blockmodeling of social interactions in that the goal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1612.03054  شماره 

صفحات  -

تاریخ انتشار 2016